Distributed means of organizing an arbitrarily large number of computers

ABSTRACT

A technique for organizing a plurality of computers such that message broadcast, content searching, and computer identification of the entire collection or a subset of the entire collection may be performed quickly without the use of a controlling computer. The technique describes the creation, operation, and maintenance of a connection scheme by which each computer in the collection appears to be the top level of a hierarchical array. The maintenance of this hierarchical connection scheme allows one to many communications throughout the collection of computers to scale geometrically rather than linearly.

BACKGROUND OF THE INVENTION

[0001] 1. Technical Field of the Invention

[0002] This invention relates to the fields of computer communications and computer networking.

[0003] 2. Description of Related Art

[0004] The invention describes a means of coordinating a plurality of computers physically connected to a network. The invention allows rapid broadcast and search of the hosts using distributed control.

[0005] Such a system is an improvement over existing centrally controlled coordination in the areas of security, attack resistance, robustness, speed, and scalability.

[0006] Physical vs. Logical Organization

[0007] The invention may be used by any computer possessing a means to communicate one to another with all other computers to be coordinated.

[0008] The invention works by arranging the physically connected computers into a virtual hierarchy that may be efficiently searched and to which messages may be broadcast.

[0009] Prior Art—Centralized Control

[0010] A collection of computers possessing the ability to communicate one to another may be coordinated by a controlling computer. The controlling computer can maintain a list of network addresses of the computer collection. The controlling computer can maintain a list describing the contents available on each computer in the collection. The controlling computer can also maintain a list a names or other identifying characteristics of each computer in the collection.

[0011] The controlling computer may broadcast a message to all the coordinated computers by reading its list of network addresses and creating and sending a message to each computer in the list. The controlling computer may respond to a query regarding the contents available in the collection of computers by searching its list of contents. When a content match is found, the controlling computer can provide the network address of the computer possessing the content.

[0012] The controlling computer may respond to a query regarding the name or other identifying characteristic of a computer in the collection by searching its list of names or other identifying characteristics of each computer in the collection. When a match to the computer name or other identifying characteristic is found, the controlling computer can provide the network address of the computer in the collection matching the desired name or other identifying characteristic.

[0013] Disadvantages of Centralized Control

[0014] 1. Scalability

[0015] 2. Security

[0016] 3. Failure sensitivity

[0017] Scalability

[0018] A controlling computer can coordinate a finite number of computers. The amount of computing power increases linearly with the number of computers to be coordinated.

[0019] At some point, the controlling computer will be unable to coordinate any more computers and the collection of computers must cease increasing.

[0020] Security

[0021] All communications between the collection of computer is coordinated by the controlling computer. A successful security attack on the controlling computer will disable all coordinated communications with the collection of computers.

[0022] Failure Sensitivity

[0023] Similarly, a software failure or hardware failure on the single controlling computer can disable coordinated communications with the entire collection of computers.

[0024] Prior Art—Hierarchical Organizations

[0025] A logical communication hierarchy of computers may be created with a single host at the top of the logical hierarchy and two or more computers at the next level. Each one of the computers at the second level is logically connected to two or more computers. Each of the computers at the third level is logically connected to two or more computers, and so on.

[0026] In the simplest case each computer is connected to a single host going up the hierarchy and to two computers going down the hierarchy. The top level of the hierarchy has a single computer. The second level has two computers. The third level has four computers. The fourth level has eight computers. Each successive logical level contains the next power of 2 number of computers.

[0027] The total number of computers in the hierarchy is the sum of the computers at each of the N levels in the hierarchy. For example in the simple sample just described, the fifth level would contain 32 computers and the entire hierarchy would contain 63 computers.

[0028] The tenth level of a ten level hierarchy would contain 1024 computers and the entire hierarchy would contain 2047 computers. The equation describing the total number of computers in such a network is 2*(2 power N

[0029] 1. Where N is the number of levels.

[0030] Advantage of Hierarchical Organizations

[0031] A virtual hierarchy such as that described above may broadcast a message from the top level computer to all computers in the hierarchy is an amount of time equivalent to:

N*(average message transit time).

[0032] For example, in an Internet environment, the message delay might be 10 msec. To broadcast a message to all computers in a ten level hierarchy containing 2047 computers would take 100 msec.

[0033] To broadcast a message to all computers in a twenty level hierarchy containing 2,097,151 computers would take only 200 msec.

[0034] Without a hierarchy, serially sending a message to 2 million computers would require 2,097,151*(average message transit time).

[0035] Disadvantages of Hierarchical Organization

[0036] 1. Inflexibility

[0037] 2. Insecurity

[0038] 3. Failure sensitivity

[0039] Inflexibility

[0040] A hierarchy is great for broadcasting a message from a constant fixed computer to a hierarchy of constant fixed computers. Should a message require broadcasting from any other computer than that at the top of the hierarchy, other mechanisms must be used such as passing the message upward to the top and then broadcasting it downward from the top of the hierarchy.

[0041] Insecurity

[0042] A hierarchy is progressively more vulnerable to disruption the closer to the top of the hierarchy one gets. In fact, if an attack were launched on the top computer of the hierarchy rendering it inoperable, the entire hierarchy would be rendered inoperable.

[0043] Failure Sensitivity

[0044] Similarly, each computer in a hierarchy is connected to two or more computers beneath it. Each of them is connected to two or more computers and so on. Should a single computer in a hierarchy fail, all the computer connected beneath it in the hierarchy would be unable to communicate.

SUMMARY OF THE INVENTION

[0045] Some of the objectives of the invention are to provide a collection of computers with:

[0046] (a) the ability to perform one to many broadcast originating from any computer in the collection without requiring a fixed hierarchical organization;

[0047] (b) the ability to search all computers in the collection for specific content without requiring a central controlling computer;

[0048] (c) the ability to locate a specific computer in the collection using a name or other identifying characteristic without requiring a central controlling computer;

[0049] (d) the ability to self organize itself so broadcast and searching may be performed in an optimal manner;

[0050] (e) the ability to self organize itself in the presence of changing computer network addresses so broadcast and searching may be performed in an optimal manner;

[0051] (f) the ability to continue broadcast and searching functions in the presence of a security attack which disables a plurality of computers in the collection.

[0052] (g) the ability to repair itself and continue broadcast and searching functions in the presence of simultaneous failure of a plurality of computers in the collection.

[0053] Further objectives will become apparent from a consideration of the ensuing description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0054] For a more complete understanding of the present invention, reference is made to the following detailed description taken in conjunction with the accompanying drawings wherein:

[0055]FIGS. 1A to 1B show a typical physical means of computers communicating one to another compared to a logical means of communicating for the same computers.

[0056]FIG. 2 shows a typical embodiment of the invention using a quadrilateral configuration for the collection of computers.

[0057]FIGS. 3A and 3B show a computer's neighbors and the linking of neighbors in the collection of computers.

[0058]FIG. 4 shows a typical embodiment of the invention using a hexagonal configuration for the collection of computers.

[0059]FIGS. 5A to 5C show the virtual hierarchy created by a typical embodiment of the invention using a quadrilateral configuration for the collection of computers.

[0060]FIGS. 6A to 6C show the path of a broadcast message originating from the top computer of the hierarchy.

[0061]FIGS. 7A and 7B show a new computer being added to the collection of computers.

[0062]FIGS. 8A and 8B shows a non-optimized view of a quadrilateral configuration for the collection of computers and an optimized view of the same collection of computers.

[0063] FIGS. 9A-1 to 9P show the self organizing states of a quadrilateral configuration for the collection of computers.

[0064]FIGS. 10A to 10D show a view of a quadrilateral configuration with three missing computers.

[0065]FIG. 11 shows the organization of computers with a subset of computers performing caching.

REFERENCE NUMERALS IN DRAWINGS

[0066]10 logical middle of the collection of computers

[0067]11 top computer of a hierarchy

[0068]12,13,14,15,16,17,18,19,20,21,22,23 computers 24 physical means of communication 25 logical means of communication 26 radial 27 indirect radial 28 found computer 29 disable computer 30 collection edge 31 logical connection 32 new computer 33 caching computer 34 searching computer 40 head 41 right hand 42 toe 43 left hand 44 WEBcast server 45 WEBcast player

DETAILED DESCRIPTION OF THE INVENTION

[0069] Reference is now made to the Drawings wherein like reference characters denote like or similar parts throughout the various Figures.

[0070] Description—FIGS. 1 to 3

[0071] Each computer 10,12,13,14,15 in the collection possesses a physical means 24 to communicate one to another as illustrated in FIG. 1A. The physical means of communication may be reorganized to produce a logical means to communicate 25 one to another as illustrated in FIG. 1B.

[0072] In an Internet embodiment, FIG. 1A would consist of computers physically connected via local area networks, routers, and the Internet backbone. In an Internet embodiment, FIG. 1B would consist of computers logically connected via (IP) Internet Protocol addresses.

[0073] The present invention is primarily directed to the logical configuration of a computer network, irrespective of the particular physical means of communication between computers in the network. A typical embodiment of the invention in a quadrilateral configuration is illustrated in FIG. 2. The logical middle 10 of the collection possesses a logical means to communicate 25 to four neighbor computers 12,13,14,15 that comprise a concentric square. Each computer in the collection possesses a logical means to communicate 25 to four neighbors. The concentric square consisting of four computers 12,13,14,15 is in turn logically connected with the concentric square consisting of eight computers 16,17,18,19,20,21,22,23. The collection of computers ends at the collection edge 30.

[0074] The logical means to communicate 25 is defined by a neighbor relationship. Each computer possesses links to four neighbors. FIG. 3A illustrates each computer's neighbors as neighbors, 40, neighbor1 41, neighbor2 42, and neighbor3 43. Neighbor1 41 is to the right of (or counterclockwise from) neighbor0 40, neighbor2 42 is to the right of (or counterclockwise from) neighbor1 41, and neighbor3 43 is to the right of (or counterclockwise from) neighbor2 42.

[0075] In FIG. 3B the neighbor0s 40 of four computers 12,13,14,15 point to the logical center 10 of the collection. The neighbor2s 42 of these computers 12,13,14,15 point to four more computers 16,17,18,19,20,21,22,23 and so on.

[0076] The neighbor2 42 to neighbor0 40 configuration of the computers emanating from the logical center 10 of the collection may be considered radials 26. The radials 26 pass through the computers at the vertices of the concentric quadrilaterals. The neighbor0s 40 of computers on a radial point toward the logical middle of the collection of computers. The neighbor2s 42 of computers on a radial point toward the collection edge 30.

[0077] The neighbor 41 of every computer on a radial 26 point to a line of neighbor2 42 to neighbor0 40 relationships which form indirect radials 27. The neighbor0s 40 of computers on an indirect radial 27 point toward a radial 26. The neighbor2s 42 of computers on an indirect radial 27 point toward the collection edge 30. Generally, the neighbor relationships are used for logically organizing the computers, while the radials 26 and indirect radials are used for disseminating information throughout the collection of computers.

[0078] A typical embodiment of the invention in a hexagonal configuration is illustrated in FIG. 4. As will be appreciated by persons of ordinary skill in the art, the hexagonal configuration possesses six radials 26 emanating from the logical center 10 of the collection, while indirect radials 27 generally emanate from a neighbor 2 (out of a total of six neighbors) of every computer on a radial 26. Although the invention is described in connection with a quadrilateral or hexagonal configuration, configurations with any even plurality of sides are possible in accordance with the invention. Three dimension configurations are also possible. The more sides in the configuration, the more states exist in managing the collection of computers and the faster the broadcast and search of the entire collection may be performed. In any event, it will be recognized that, among other things, the orientation of the indirect radial depends on the particular configuration.

[0079] Operation—FIGS. 5 to 7

[0080] The invention creates a logical organization in which each and every computer in the collection appears to be at the top of a hierarchy formed by concentric polygons. For purposes of describing the invention, the logical middle 10 of the collection of computers corresponds to the geometrical center, while the top computer 11 in the hierarchy represents a location at which a search or broadcast originates. As a result, the top computer 11, at any given time, changes based on which computer in the overall hierarchy is acting as a source of a broadcast, search, or other dissemination of information throughout the network or a portion thereof. FIG. 5A illustrates a hierarchy emanating from the top computer 11 in the hierarchy through a collection of computers 12,13,14,15,16,17,18,19,20,21,22,23 organized into concentric squares. In the example illustrated by FIG. 5A, the top computer 11 in the hierarchy is also the logical middle 10 of the collection of computers.

[0081] In the case of the quadrilateral configuration, the number of computers in the concentric squares increases by four from concentric square to concentric square. The first square surrounding the top computer 11 in the hierarchy contains four computers 12,13,14,15. The next concentric square contains eight computers 16,17,18,19,20,21,22,23. The next concentric square contains twelve computers, and so on.

[0082]FIG. 5B illustrates a hierarchy emanating from the top computer 11 in the hierarchy through a collection of computers 12,13,14,15,16,17,18,19,20,21,22,23 organized into concentric squares. In the example illustrated by FIG. 5B, the top computer 11 in the hierarchy is not the logical middle 10 of the collection of computers.

[0083] The number of computers in the concentric squares increases by four from concentric square to concentric square. The first square surrounding the top computer 11 in the hierarchy contains four computers 12,13,14,15. The next concentric square contains eight computers 16,17,18,19,20,21,22,23. The next concentric square (not fully shown) contains twelve computers, and so on.

[0084]FIG. 5C illustrates a hierarchy emanating from the top computer 11 in the hierarchy through a collection of computers 12,13,14,15,16,17,18,19,20,21,22,23 organized into concentric squares. In the example illustrated by FIG. 5C, the top computer 11 in the hierarchy resides on the collection edge 30.

[0085] The number of computers in the concentric squares increases by four from concentric square to concentric square except computers residing on the collection edge 30 which do not possess a complete square of neighbors. In this case, therefore, the first square surrounding the top computer 11 in the hierarchy contains two computers 12,13. The next concentric square contains five computers 16,17,18,19,20. The next concentric square (not fully shown) contains six computers. The next concentric square contains nine computers, and so on.

[0086] Message Broadcast

[0087] One-to-many message broadcast may efficiently be performed by the collection of computers as each computer passes the broadcast to either one or two more computers in the next concentric polygon. FIG. 6 illustrates the rapid increase in number of computers reached with the addition of each concentric polygon.

[0088] Another look at FIG. 5A illustrates how a broadcast operation may use this configuration to relay a message from the top of the hierarchy out through the concentric squares of computers. The message is initially passed from the top computer 11 in the hierarchy to the four computers in the surrounding concentric square 12,13,14,15. In the example illustrated by FIG. 5A, the top computer 11 in the hierarchy is also the logical middle 10 of the collection of computers.

[0089] The message is then passed by the computers at the four corners of the square 12,13,14,15 to the eight computers in the surrounding concentric square 16,17,18,19,20,21,22,23. The message is then passed to the computers in the next concentric square and so on.

[0090] Another look at FIG. 5B illustrates how a broadcast operation may use this configuration to relay a message from the top of the hierarchy out through the concentric squares of computers. The message is initially passed from the top computer 11 in the hierarchy to the four computers in the surrounding concentric square 12,13,14,15. In the example illustrated by FIG. 5B, the top computer 11 in the hierarchy is not the logical middle 10 of the collection of computers.

[0091] The message is then passed by the computers at the four corners of the square 12,13,14,15 to the eight computers in the surrounding concentric square 16,17,18,19,20,21,22,23. The message is then passed to the computers in the next concentric square and so on.

[0092] Another look at FIG. 5C illustrates how a broadcast operation may use this configuration to relay a message from the top of the hierarchy out through the concentric squares of computers. In the example illustrated by FIG. 5C, the top computer 11 in the hierarchy resides on the collection edge 30. Computers residing on the collection edge 30 do not possess a complete square of neighbors.

[0093] The message is initially passed from the top computer 11 in the hierarchy to the two computers 12,13 in the surrounding but incomplete concentric square. The message is then passed to the five computers 12,13,14,15,16. in the surrounding but incomplete concentric square. The message is then passed to the computers in the next surrounding but incomplete concentric square and so on.

[0094] As can be seen in both FIGS. 5B and 5C, there is a possibility that one or more computers will be orphaned (e.g., computer 17 in FIG. 5C), at least with respect to a message that does not originate from a top computer 11 at the logical middle 10 of the collection of computers. The existence of such orphaned computers, however, does not create a problem in most applications. Preferably, although not necessarily, a broadcast will originate from a top computer 11 that is at the logical middle of the collection of computers. Thus, the broadcast will reach all of the computers in the collection. On the other hand, messages that originate from a top computer 11 that is not at the logical middle 10 frequently do not need to reach all of the computers in the collection. For example, a search for a specified file or application normally does not have to be exhaustive because there is often sufficient redundancy in a computer network to locate a subject of a search without querying every computer in the network.

[0095] Searching the Collection of Computers for Content

[0096] A search of content residing on computers in the collection may be performed if the message passed through the hierarchy contains search parameters and the network address of the requesting computer. The message will radiate through the hierarchy causing each computer in the collection to search its local content. When a computer being searched finds a match to the searched content, that computer contacts the network address of the requesting computer and identifies the network address where the content is located.

[0097] Locating a Computer by a Name or Other Identifying Characteristic.

[0098] A computer in the collection of computers may be located by a name or other identifying characteristic if the message passed through the hierarchy contains the name or other identifying characteristic and the network address of the requesting computer. The message will radiate through the hierarchy causing each computer in the collection to compare the name or other identifying characteristic to its own name or other identifying characteristic.

[0099] Initially Creating the Collection of Computers

[0100] The collection of computers must begin with a single computer which will be the initial logical middle 10 of the collection of computers. The next four additions to the collection of computers will constitute the neighbor0

[0101]40, neighbor1 41, neighbor2 42, and neighbor3 43 neighbors of the logical middle 10 of the collection of computers.

[0102] Adding Additional Computers to the Collection of Computers

[0103] In order to become part of the collection of computers, a computer must first find another computer which is part of the collection of computers.

[0104] A computer can find to the collection of computers using several techniques including but not limited to:

[0105] (a) Trying to attach to a known list of available computers in the collection of computers.

[0106] (b) Trying to attach to a computer from a list of computers with which this computer has previously communicated.

[0107] (c) Seeking a computer connected to the collection of computers by broadcasting queries to network addresses created from an algorithm such as a random number generator.

[0108] When a new computer 32 locates a computer belonging to the collection of computers, the found computer 28 (see FIG. 7A) will reside either on a radial 26 or indirect radial 27. The neighbor2 42 of the found computer 28 will point toward the collection edge 30. By following the found computer's 28 neighbor's neighbor2s 42 one after another, the collection edge 30 may be located. The new computer 32 is attached to the collection of computers at the edge 30.

[0109]FIG. 7A illustrates following a radial 26 from the found computer 28 to the collection edge 30 to attach a new computer 32.

[0110]FIG. 7B illustrates following an indirect radial 27 from the found computer 28 to the collection edge 30 to attach a new computer 32.

[0111] Self Organizing a Hierarchy

[0112] The collection of computers may be searched more rapidly if it maintains itself as a symmetrical compact shape such as that illustrated in FIG. 8A rather than a collection of long thin strings as illustrated in FIG. 8B. For example, a message can be broadcast to all 25 members of the collection of computers illustrated in FIG. 8A within three hops from the logical middle 10 of the collection of computers. However a message requires fourteen hops to be fully broadcast to the members of the collection of computers illustrated in FIG. 8B.

[0113] To maintain symmetrical compactness of the collected computers, each computer in the collection follows a goal seeking behavior illustrated in FIGS. 9A-1 to 9H and generally defined as:

[0114] (a) Orbit counter clockwise at the same level of concentric polygon until another computer is encountered;

[0115] (b) Decay inward until another computer is encountered.

[0116] The result of the above two rules applied by each computer in the collection will result in the creation of a logical network in the shape of a near perfect quadrilateral (or other polygon, depending on the configuration).

[0117] Self Organizing States

[0118] In the preferred embodiment, each unit follows the goal seeking behavior illustrated in FIGS. 9A-1 to 9H through the logic of a state machine. A state machine is a logical mechanism that defines the existence of a plurality of physical or logical states of being and the occurrences necessary to change the mechanism from one state of being to another.

[0119] For purposes of clarity, neighbor0 40 may be referred to as N0. Similarly neighbor1 41 may be referred to as N1, neighbor2 42 may be referred to as N2, and neighbor3 43 as N3. In some states, both the existence of a neighbor and existence of a neighbor's neighbor determine the state. In such instances, for clarity, the neighbor0 of neighbor0 is referred to as N00. Similarly the neighbor2 of neighbor1 is referred to as N12.

[0120] FIGS. 9A-1 to 9A-4 illustrate the state diagram of the goal seeking behavior of an individual computer relative to the collection of computers of which it is a part. In particular, FIGS. 9A-1 to 9A-4 exemplify the possible state transitions at least for a quadrilateral configuration. These states, however, relate only to the logical organization of the computers with respect to the logical middle 10 and not to the identify or location, at any particular time, of the top computer 11. For clarity, Each computer in the collection of computers may exist in one of the following states based on the existence and state of its neighbor units and its proximity to a radial 26:

[0121] State 1 (illustrated in FIG. 9B)—The computer is searching for a found computer 28 in the collection of computers. Three strategies are used:

[0122] (a) Search a pre existing list of network addresses of computers known to belong to the collection of computers.

[0123] (b) Search a cache of network addresses of computer with which the searching unit communicated when previously connected to the collection of computers.

[0124] (c) Use a brute force search of all possible network addresses of computers. In an embodiment using Internet addresses, the search will be made by generating random 32-bit numbers corresponding to Internet Protocol (IP) addresses and excluding the ranges of non routable IP addresses.

[0125] The searching computer confirms location of a computer in the collection of computers by executing a handshake protocol consisting of the following exchange:

[0126] (a) Searching Unit—“Are you connected to the collection of computers?”

[0127] (b) Queried Unit—“Yes I am, no I am not, or I don't understand.”

[0128] When the searching computer locates the collection of computers, its state becomes State 2.

[0129] State 2 (illustrated in FIG. 9C)—The computer has located the collection of computers and is attempting to locate the collection edge 30. The computer follows the neighbor2 42 neighbor links of the found computer 28 to locate the next closest computer to the collection edge 30. The computer will continue to follow the neighbor2 42 neighbor links of successive neighbors until a neighbor is found with no neighbor2 42 link. A neighbor without a neighbor2 42 link resides on the collection edge 30.

[0130] State 3 (illustrated in FIG. 9D)—The computer is located on the collection edge 30 and on a radial 26. Since the computer is located on the collection edge 30, the computer's neighbor2 42 does not exist. Furthermore, as illustrated in FIG. 9D the neighbor01 position is vacant.

[0131] At the first opportunity, the computer will move into the neighbor01 position thereby moving closer to the logical middle 10 of the collection of computers.

[0132] State 4 (illustrated in FIG. 9E)—The computer is located on the collection edge 30 and therefore the computer's neighbor2 42 does not exist. The computer is not located on the radial, but is touching it. The computer's neighbor1 41 does not exist.

[0133] At the first opportunity the computer will move into the neighbor01 position thereby moving closer to the logical middle 10 of the collection of computers.

[0134] State 5 (illustrated in FIG. 9F)—The computer is located on an indirect radial 27. Neighbor1 41 does not exist. Neighbor2 42 does not exist, and the neighbor01 position is filled.

[0135] At the first opportunity the computer will move onto the indirect radial 27 behind the neighbor01 position thereby moving closer to the logical middle 10 of the collection of computers.

[0136] State 6 (illustrated in FIG. 9G)—The computer is located on an indirect radial 27. Neighbor1 41 does not exist. Neighbor2 42 does not exist. The neighbor01 position is vacant.

[0137] At the first opportunity the computer will move into the neighbor01 position.

[0138] State 7 (illustrated in FIG. 9H)—The computer is located on an indirect radial 27, but its Neighbor1 41 is a radial 26. Neighbor2 42 does not exist.

[0139] At the first opportunity the computer will move onto the radial 26 behind the neighbor01 position.

[0140] State 8 (illustrated in FIG. 9I)—The computer is located on an indirect radial 27. The N12 position is vacant.

[0141] At the first opportunity the computer will move into the N12 position.

[0142] State 9 (illustrated in FIG. 9J)—The computer is located on an indirect radial 27. Neighbor1 41 exists and Neighbor1 41 is on a radial 26.

[0143] This is a stable state. No movement is possible without other neighbors moving first.

[0144] State 10 (illustrated in FIG. 9K)—The computer is located on a radial 26. Either Neighbor1 41 or Neighbor2 42 exist preventing movement.

[0145] This is a stable state. No movement is possible without other neighbors moving first.

[0146] State 11 (illustrated in FIG. 9L)—The computer is located on an indirect radial 27. Either Neighbor2 42 or N12 exist preventing movement. One neighbor must exist to prevent movement.

[0147] This is a stable state. No movement is possible without other neighbors moving first.

[0148] State 12 (illustrated in FIG. 9M)—The computer is located on a radial 26. Neighbor0 40 is vacant. Either neighbors 41 or neighbor3 43 exist so there is a way to link to the neighbors of the missing neighbor0 40.

[0149] At the first opportunity, the computer will move into the vacant neighbor0 40 position.

[0150] State 13 (illustrated in FIG. 9N)—The computer is located on an indirect radial 27 but is touching a radial 26. Neighbor0 40 is vacant. Either neighbor1 41 or neighbor3 43 exist so there is a way to link to the neighbors of the missing neighbors 40.

[0151] At the first opportunity, the computer will move into the vacant neighbors 40 position.

[0152] State 14 (illustrated in FIG. 9O)—The computer is located on an indirect radial 27. Neighbor0 40 is vacant. Either neighbor1 41 or neighbor3 43 exist so there is a way to link to the neighbors of the missing neighbors 40.

[0153] At the first opportunity, the computer will move into the vacant neighbors 40 position.

[0154] State 15 (illustrated in FIG. 9P)—The computer is located on an indirect radial 27. Neighbor0 40 exists. Neighbor1 41 is vacant. Neighbor2 42 is vacant. Neighbor 01 is vacant.

[0155] At the first opportunity, the computer will move into the vacant neighbor01 position.

[0156] Bandwidth Availability Sorting

[0157] After entering one of the stable states, each computer will compare its available network bandwidth with that of its Neighbor0 40. If the computer's available network bandwidth is greater than that of its Neighbor0 40, the computer and its Neighbor0 40 will swap places in the collection of computers.

[0158] The effect of the computers swapping places is that the collection of computers becomes sorted by available network bandwidth. The computers with the greatest amount of available network bandwidth will be closest to the logical middle 10 of the collection of computers.

[0159] Failure Recovery

[0160] The collection of computers can rebuild the connections necessary for broadcast and searching in the event a computer in the collection becomes disabled by a hacking attack or ceases functioning due to technical or network problems.

[0161]FIG. 10A illustrates the collection of computers following the disabling of several computers. The disabled computers 29 are unable to pass along broadcast messages and must therefore be replaced. FIG. 10B through FIG. 10C illustrate the process by which the remaining computers in the collection reorganize the remaining computers.

[0162] Once the disabled computers have been removed from the interior of the collection of computers, the reorganization will continue to rebuild the symmetrical compactness illustrated in FIGS. 9B to 9K.

[0163] Computer Locking

[0164] Each computer in the collection of computers functions as an autonomous unit asynchronously related to its neighbors. In order to synchronize the movements of computers to different positions in the collection, it is necessary to prevent race conditions or ambiguous situations which could occur should a computer make a decision based on the states of its neighbors and move its position at the same time the neighbor's states are changing.

[0165] For this reason a computer in the collection will lock its neighbors from making any moves until it:

[0166] (a) Senses the state of its neighbors.

[0167] (b) Decides if a move is necessary.

[0168] (c) Performs the move.

[0169] The lock has a timeout to prevent a never ending lock should the locking computer be disabled in some way before releasing the lock.

[0170] Limiting Broadcast or Searches

[0171] In some cases it may be desirable to limit message broadcast or content searches to a subset of the collection of computers. In that case, the broadcast or search may be limited by specifying the number of concentric rings to search relative to the computer requesting the broadcast or search.

[0172] Bandwidth Throttling

[0173] If all computers in the collection of computers do comprehensive message broadcasts or content searches, the communications means logically connecting the computers may become congested.

[0174] Any computer in the collection of computers can view the sum total of the communications traffic between all computers. Should the communications traffic begin to approach to capacity of the logical communications channel a means of reducing the traffic must be considered.

[0175] The following technique is fair to each user of the collection of computers, rewards efficient use, and penalizes overused. Before each broadcast or search is initiated, each and every computer in the collection of computers will perform the following before performing a broadcast or search:

[0176] (a) Measure the logical communication channel bandwidth utilization.

[0177] (b) If the utilization is below a predetermined desired threshold, proceed with the broadcast or search, otherwise,

[0178] (c) Calculate the time since the last search.

[0179] (d) If the time since the last search is less than a predetermined amount, insert a predetermined delay in front of the request for broadcast or search which is related to the amount the communications channel bandwidth utilization exceed the predetermined desired threshold.

[0180] The above algorithm will assure that broadcast and search performance will degrade gracefully under heavy use of the collection of computers.

[0181] Caching Computers

[0182] If the collections of computers large enough and search demands frequent enough to fill the logical communication channel bandwidth, a more efficient use of bandwidth is possible by defining a subset of the collection of computers to perform a caching function. The computers chosen to perform the caching function are those with faster network connections.

[0183]FIG. 11 illustrates the preferred embodiment of the caching organization. In FIG. 11 the caching computers 33 are organized into a collection of computers similar to the collection of non-caching computers shown in FIG. 2. Each caching computer 33 is the logical middle of a collection of computers. As such, the caching computers 33 and the underlying collections of computers represent a hierarchy within a hierarchy or, in an alternative way of looking at it, a simple type of three dimensional configuration. Each caching computer 33 caches the content index and name or other identifying characteristic of each computer in the collection of computers which surround the caching computer 33.

[0184] Each caching computer 33 is also a member of the collection of caching computers. The collection of caching computers self organizes itself so that the computer with the most available network bandwidth resides at the logical middle 10 of the collection of caching computers.

[0185] Each caching computer in the collection of caching computers compares its available network bandwidth with the network bandwidth of its neighbor nearer the logical middle of the collection of caching computers. If the caching computer possesses more available network bandwidth than its neighbor, the computer and its neighbor swap positions in the collection of caching computers.

[0186] Each caching computer in the collection continuously performs the compare and swap operation, such that the collection of caching computer is always sorted with the computer having the most available network bandwidth located at the logical middle of the collection of caching computer and each concentric polygon contains computers with successively less available network bandwidth.

[0187] Adding a Caching Computer

[0188] A caching computer is added to the collection of caching computers in much the same way as a computer is added to the collection of computers as described in Self Organizing a Hierarchy and illustrated in FIGS. 9A-1 to 9P.

[0189] A new caching computer can find the collection of caching computers using several techniques including but not limited to:

[0190] (a) Trying to attach to a known list of available caching computers in the collection of caching computers.

[0191] (b) Trying to attach to a caching computer from a list of caching computers with which this computer has previously communicated.

[0192] (c) Seeking a computer connected to the collection of caching computers by broadcasting queries to network addresses created from an algorithm such as a random number generator.

[0193] When a new caching computer locates a computer belonging to the collection of caching computers the found caching computer will reside either on a radial 26 or an indirect radial 27. The tail 41 of the found caching computer 28 will point toward the collection edge 30. By following the found caching computer's 28 neighbor's tail to head one after another, the collection edge 30 may be located. The new caching computer is attached to the collection of caching computers at the edge 30.

[0194] To maintain symmetrical compactness of the collected computers, each computer in the collection follows a goal seeking behavior as illustrated in FIG. 9:

[0195] (a) Orbit counter clockwise at the same level of concentric polygon until another computer is encountered;

[0196] (b) Decay inward until another computer is encountered.

[0197] A newly added caching computer will have a large amount of available network bandwidth, and as such will swap positions with its neighbors until it reaches the logical middle of the collection of caching computers. Preferably, a newly added computer will be designated as a caching computer based on whether the newly added computer possesses an available amount of bandwidth greater than some threshold. Newly added computers that do not possess an amount of bandwidth over the threshold are added as non-caching computers.

[0198] Adding a Non-caching Computer

[0199] In a caching system, a new computer 32 locates the collection of computers and then follows the head to toe links until it reaches the logical middle 10 of its collection of computers. The logical middle will be a caching computer that also belongs to the collection of caching computers.

[0200] The new computer 32 will follow the head to toe links of the collection of caching computers until it reaches the logical middle of the collection of caching computers.

[0201] The new computer 32 will provide the caching computer with its network address, the index of its content, and its name or other identifying characteristics. The new computer 32 will then follow a radial 26 of the collection of non-caching computers attached to the logical middle of the collection of caching computers. The new computer 32 will attach itself to the edge 30 of the collection of computers and begin the self-organizing logic to seek a position.

[0202] Self Balancing Cache

[0203] Due to the bandwidth availability comparison logic, the computer at the logical middle of the collected caching computers will always be the caching computer with the most available bandwidth. New non-caching computers will always be added to the collection of non-caching computers attached to this caching computer.

[0204] As more non-caching computers are added to the caching computer with the most available bandwidth, it will eventually have less available bandwidth than another caching computer in the collection of caching computers and be replaced at the middle of the collection of caching computers by a computer with more bandwidth available.

[0205] In the above fashion, the collection of caching computers will always maintain an optimally balanced distribution of non-cached computers attached to each caching computer.

[0206] Unavailable Computer

[0207] From time to time, a caching computer will poll each of the computers in its collection of non-caching computers. When a computer that is a member of a collection of computers headed by a caching computer becomes unavailable or unusable through some sort of failure, the caching computer will remove the unavailable computers cached content index, name, and other identifying characteristics.

[0208] Unavailable Caching Computer

[0209] From time to time, a caching computer will fail to respond to communications from non-caching computers in its collection of computers. The caching computer will be replaced by one of the non-caching computers in its collection of computers using the algorithms illustrated in FIGS. 9A-1 to 9P.

[0210] Should there be no more non-caching computers available in the disabled caching computers collection of computers, the collection of caching computers will fill in the void using the logic illustrated in FIGS. 9A-1 to 9P.

[0211] Auto-update

[0212] The invention embodies a feature by which a computer compares its version of software that controls the collection of computers to that of the neighbor 40,41,42,43 with which it is preparing to communicate. If the computer requesting the communication possesses a more recent version of the software that controls the collection of computers, then that version of software is transferred to the neighbor 40,41,42,43.

[0213] If the neighbor 40,41,42,43 to which communications is being requested posses a more recent version of the software that controls the collection of computers, then the more recent version of the software is transferred from the neighbor 40,41,42,43 to the computer requesting the communications.

[0214] In this fashion, a software update applied to any computer in the collection of computers will propagate through the collection of computers at about the same rate as a message broadcast.

[0215] Distributing Executables Across the Collection of Computers

[0216] It is possible using the auto-update mechanism described above to distribute executable programs to all computers in the collection of computers.

[0217] It is possible using the auto-update mechanism described above to distribute executable programs to a subset of all the computers in the collection of computers by limiting the distribution to computers within a fixed number of concentric polygons of the computer initiating the distribution.

[0218] The computers receiving executable programs using the auto-update mechanism may be commanded to perform certain operations using the executable programs distributed using the auto-update mechanism including executing the programs to perform a calculation or other operation and returning a result to the computer initiating the distribution of the executable.

[0219] Broadcast of Streaming Media

[0220] One embodiment of the invention provides for the one to many broadcast of streaming media. Streaming media include but are not limited to WEB radio and corporate WEBcasts.

[0221] Current broadcast technology requires the originator posses a large server and high speed network connection necessary to open the required channel to each and every destination as illustrated in FIG. 12. Therefore a doubling of destinations requires a doubling of the originator's network bandwidth.

[0222] The invention offers an efficient means to broadcast streaming media by sharing the necessary bandwidth and computing power with each destination computer. FIG. 13 illustrates the streaming media possible with the collection of computers created by the invention.

[0223] The advantages of the invention over existing solutions are:

[0224] (a) The originator's network bandwidth need only be as large as that necessary for a single stream of the media.

[0225] (b) The number of destinations may be increased irrespective of the bandwidth of the originator's network connection.

[0226] (c) The number of destinations may be increased virtually without limit.

[0227] Making a Streaming Media Connection

[0228] A WEB radio station is an existing example of streaming media. With current technology, a user with a media player program contacts the station's WEB page, provides the user's network address, and requests to be connected to the station's streaming media server. The media server opens a connection and begins sending the media information to the user's media player at the user's network address. The media information is virtually the same as that sent to every other user.

[0229] When using one embodiment of the invention, a user with a media player program and a program implementing the invention contacts the station's WEB page, provides the user's network address, and requests to be connected to the station's streaming media server. The station streaming media server is using a version of the invention.

[0230] The media server directs the new user to the logical middle of the collection of computers 10. The new user's computer 32 follows the protocol described in FIGS. 9A-1 to 9P to attach to the collection of computers. Upon attachment to the collection of computers, the new computer 32 will begin receiving the streaming media from the neighbor to which its head 40 is attached.

[0231] When yet another computer is attached to the new computer 32, the new computer 32 will forward the streaming media to the added computer.

[0232] When a Computer Disconnects or Becomes Unavailable

[0233] When a computer in the collection of computers used to broadcast streaming media disconnects or otherwise becomes unavailable, the invention replaces the unavailable computer in the collection of computers using the protocol illustrated in FIGS. 10B and 10C.

[0234] Bandwidth Requirements

[0235] Each computer in the collection of computers requires an available outbound network bandwidth the same as the inbound network bandwidth of the streaming media. The exceptions are computers which reside on radials 26 which require twice the available outbound bandwidth as inbound bandwidth.

[0236] Advantages of the Invention

[0237] The invention possesses the following advantages over the previous art include:

[0238] (a) The ability to broadcast a message from any computer in a collection of computers to broadcast to the balance of the collection by distributing the computing power and communications bandwidth required by the broadcast to the collection of computers.

[0239] (b) The ability of any computer in a collection of computers to search for content in a collection of computer by distributing the computing power and communication bandwidth required by the search to the collection of computers.

[0240] (c) The ability of any computer in a collection of computers to search for another computer in the collection of computers by a name or other identifying characteristic by distributing the computing power and communication bandwidth required by the search to the collection of computers.

[0241] (d) The ability to self organize computers into a collection of computers such that the computing power and communication bandwidth of the collection may be used to broadcast from one computer to the balance of computers in the collection; such that the computing power and communication bandwidth of the collection may be used to search for content existing on the collection of computers; and such that the computing power and communication bandwidth of the collection may be used to locate a computer in the collection by name or other identifying characteristic.

[0242] (e) The ability to self organize computers which possess transient network addresses into a collection of computers such that the computing power and communication bandwidth of the collection may be used to broadcast from one computer to the balance of computers in the collection; such that the computing power and communication bandwidth of the collection may be used to search for content existing on the collection of computers; and such that the computing power and communication bandwidth of the collection may be used to locate a computer in the collection by name or other identifying characteristic.

[0243] (f) The ability of an organized collection of computers to self repair itself after some computers become inoperative to an attack or technical malfunction.

[0244] Referring now to FIG. 1,

[0245] Although a preferred embodiment of the method and apparatus of the present invention has been illustrated in the accompanying Drawings and described in the foregoing Detailed Description, it is understood that the invention is not limited to the embodiment disclosed, but is capable of numerous rearrangements, modifications, and substitutions without departing from the spirit of the invention as set forth and defined by the following claims. 

What is claimed is:
 1. A distributed computer network, comprising: a plurality of processors, and at least one communication medium for interconnecting the plurality of processors: wherein the plurality of processors are logically arranged such that each processor can operate at a top level of a hierarchy that includes at least a significant number of the plurality of processors by sending a message to at least one logically neighboring processor; wherein the message is disseminated throughout the hierarchy by each processor that receives the message forwarding the message to at least one logically neighboring processor such that each processor in the hierarchy receives the message only once.
 2. The distributed computer network of claim 1, wherein the at least one communication medium includes at least one physical interconnection unrelated to the logical arrangement of the plurality of processors.
 3. The distributed computer network of claim 1, wherein each processor that receives the message forwards the message to one or two logically neighboring processors.
 4. The distributed computer network of claim 1, wherein the plurality of processors include a processor situated at a logical center and the remaining processors are logically arranged around the logical center.
 5. The distributed computer network of claim 4, wherein the plurality of processors are logically arranged in a polygonal configuration having an even number of sides.
 6. The distributed computer network of claim 4, wherein the plurality of processors are logically arranged in a three dimensional configuration.
 7. The distributed computer network of claim 4, wherein each processor tends to move to a location closer to the logical center if said location is not occupied by another processor.
 8. The distributed computer network of claim 7, wherein each processor further tends to move in a predetermined direction to an adjacent location on the same logical level if said adjacent location is not occupied by another processor.
 9. The distributed computer network of claim 4, wherein each processor tends to switch positions with an adjacent processor closer to the logical center when the adjacent processor has less available bandwidth than said processor.
 10. The distributed computer network of claim 1, wherein the message relates to a broadcast of data.
 11. The distributed computer network of claim 1, wherein the message relates to a search for information selected from the group consisting of specified data and a specified processor.
 12. A distributed computer network comprising: a collection of computers logically arranged such that a first computer of the collection of computers is situated at a logical center of the collection of computers, wherein a plurality of computers from the collection of computers form a series of concentric polygons around the first computer; and wherein each computer in the collection of computers can act as a top computer in a hierarchy of computers, said hierarchy including at least a subset of the collection of computers by: said top computer sending a message along each of at least one radial, each of said at least one radial comprising a line of logically adjacent computers in the collection of computers that logically extends radially from said top computer; and at least one lower level computer, of the collection of computers, located on one of said radials further forwarding the message along an indirect radial, each indirect radial comprising a line of logically adjacent computers in the collection of computers that logically extends radially from said at least one lower level computer but does not logically intersect any of the at least one radial.
 13. The distributed computer network of claim 12, wherein each computer not located on an outermost edge of the collection of computers has the same number of radials extending therefrom as there are sides of the concentric polygons.
 14. The distributed computer network of claim 12, wherein each computer operates to: move to a position closer to the logical center when said closer position is not occupied by another computer; and move, in one of a clockwise and a counterclockwise direction, to a position at the same level as a current position of the computer when the same level position is not occupied by another computer.
 15. The distributed computer network of claim 14, wherein each computer further operates to prevent neighboring computers from moving during each of said moving to a closer location and moving to a same level position.
 16. The distributed computer network of claim 12, wherein each respective computer in the collection of computers stores information relating to each of a plurality of subordinate computers logically connected to and located around the respective computer.
 17. The distributed computer network of claim 16, wherein a top computer in the collection of computers can initiate a search for content on the plurality of subordinate computers that correspond to each computer in the collection of computers by sending said message.
 18. The distributed computer network of claim 12, wherein said message is selected from the group consisting of broadcast data, a search parameter, and update information.
 19. The distributed computer network of claim 12, wherein, other than the top computer, each computer on a radial forwards the message to two other computers and each computer not on a radial forwards the message to one other computer.
 20. The distributed computer network of claim 19, wherein each of the computers in the collection of computers is forwarded the message only once.
 21. A method for communicating in a computer network, comprising: logically arranging a plurality of computers around a first computer situated at a logical center of the plurality of computers; initiating a message at a top computer selected from the plurality of computers; sending the message from the top computer along at least one series of logically adjacent subordinate computers that logically extends radially from the top computer, the plurality of computers including said subordinate computers; and forwarding the message, from at least one of the subordinate computers that logically extend radially from the top computer, along at least one series of logically adjacent computers that logically extends radially from the at least one subordinate computer but that does not intersect any of the series of logically adjacent subordinate computers that logically extend radially from the top computer.
 22. The method of claim 21, wherein the step of logically arranging comprises establishing a plurality of logically neighboring computers for each computer, wherein each computer has no more than a predetermined number of logically neighboring computers, and wherein the plurality of computers are evenly distributed around the first computer.
 23. The method of claim 21, further comprising the step of switching positions of at least two adjacent computers to move computers with lower bandwidth availability away from the logical center of the plurality of computers.
 24. The method of claim 21, further comprising the step of delaying sending of the message from the top computer if a bandwidth utilization of the plurality of computers is above a predetermined threshold.
 25. A method for logically configuring a collection of computers, comprising: selecting a computer to serve as a logical center of the collection of computers; adding computers to the collection of computers to logically configure the computers into a plurality of concentric polygons, wherein each added computer operates to: find a computer in the collection of computers; follow one of a radial and an indirect radial that includes the found computer to a collection edge, said radial comprising a series of logically adjacent radial computers that logically extend from the logical center, and said indirect radial comprising a series of logically adjacent computers that logically extend from one of the radial computers, wherein the collection edge comprises a logically outermost computer on said one of the radial and the indirect radial; and logically attach to a computer the collection of computers on the collection edge.
 26. The method of claim 25, further comprising the step of moving each added computer to a neighboring logical position that is logically closer to the logical center of the collection of computers if said closer neighboring logical position is not currently occupied by one of the computers in the collection of computers.
 27. The method of claim 26, further comprising the step of rotating each added computer to a neighboring logical position on the same logical level as the added computer if the same level neighboring logical position is not currently occupied by one of the computers in the collection of computers.
 28. The method of claim 27, wherein the step of rotating comprises rotating in a preselected one of a clockwise and a counterclockwise direction.
 29. The method of claim 27, further comprising the step of preventing other computers from moving into the closer neighboring logical position and from moving into the same level neighboring logical position during said steps of moving and rotating.
 30. The method of claim 25, wherein each of the plurality of concentric polygons has the same number of sides and has an even number of sides.
 31. A method for logically configuring a collection of computers, comprising: selecting a computer to serve as a logical center of the collection of computers; arranging computers from the collection of computers such that the collection of computers are logically configured to form a plurality of successively higher concentric polygon levels around the logical center; adding a computer to the collection of computers; logically connecting the added computer to a computer in the collection of computers, located at a collection edge, wherein the collection edge comprises a logical outer edge of the collection of computers and forms at least a partial concentric polygon level around the plurality of concentric polygon levels; and repeating the steps of: changing a logical location of the added computer to a next lower concentric polygon level if a computer in the collection of computers is not situated at a logical position that neighbors the added computer at the next lower concentric polygon level; and changing a logical location of the added computer to a logically adjacent position on a current concentric polygon level of the added computer if a computer in the collection of computers is not situated at said logically adjacent position.
 32. The method of claim 31, further comprising the step of sending a message from a top computer of the collection of computers to each of a plurality of neighboring radial computers, each neighboring radial computer forwarding the message to another neighboring radial computer and to a neighboring indirect radial computer, such that the message is forwarded to each computer in the collection of computers only once.
 33. The method of claim 31, wherein the collection of computers comprises one of a collection of caching computers and a collection of non-caching computers, wherein each caching computer stores information relating to a corresponding collection of caching computers.
 34. A computer network, comprising: a collection of caching computers logically arranged such that a first caching computer is situated at a logical center of the collection of caching computers, wherein the remaining caching computers are logically arranged to form at least one concentric polygon around the first caching computer; at least one collection of non-caching computers, each respective collection of non-caching computers logically arranged to form a plurality of successively higher concentric polygon levels around a respective caching computer that stores information relating to the respective collection of non-caching computers; at least one communication medium providing a physical interconnection between the caching computers in the collection of caching computers and the non-caching computers in the at least one collection of non-caching computers, said physical interconnection unrelated to said logical arrangements; and at least one of the collection of caching computers and the at least one collection of non-caching computers logically arranged such that a message originating at a top computer is forwarded along each of at least one radial, each said radial comprising a line of logically adjacent computers that logically extends radially from the top computer, and wherein a plurality of computers forming the radial further forward the message along an indirect radial, each said indirect radial comprising a line of logically adjacent computers that logically extends radially from a corresponding one of the plurality of computers and that does not intersect any of the at least one radial.
 35. The computer network of claim 34, wherein each caching computer operates to determine whether its available bandwidth is greater than an available bandwidth of a logically adjacent caching computer logically closer to the first caching computer and to switch positions with the logically adjacent caching computer when the available bandwidth of the caching computer is greater than the available bandwidth of the logically adjacent caching computer.
 36. The computer network of claim 35, further comprising at least one added non-caching computer, wherein the added non-caching computer logically attaches to a collection of non-caching computers associated with a caching computer currently situated at the logical center of the collection of caching computers.
 37. The computer network of claim 34, wherein the information relating to the respective collection of non-caching computers comprises an index of data stored on the respective collection of non-caching computers.
 38. The computer network of claim 34, further comprising at least one added computer, wherein the at least one added computer is assigned as one of a caching computer and a non-caching computer based on an available bandwidth of the at least one added computer.
 39. The computer network of claim 34, wherein the message comprises one of broadcast information and search request data.
 40. A distributed computer network, comprising: a collection of computers; means for an added computer to locate the collection of computers; means for the added computer to establish a connection to the collection of computers; means for each computer in the collection of computers, including the added computer, to establish a logical arrangement such that each computer in the collection of computers can act as a top level of a hierarchy, wherein the hierarchy includes at least a substantial number of the computers in the collection of computers.
 41. The distributed computer network of claim 40, wherein the hierarchy comprises a set of member computers, a membership of which depends upon a logical location of the computer that acts as the top level of the hierarchy.
 42. The distributed computer network of claim 40, further comprising means for the computer that acts as the top level of the hierarchy to initiate a search for one of a specified computer and specified data.
 43. The distributed computer network of claim 42, wherein each computer in the collection of computers includes a searchable index of the contents of the computer for facilitating said search.
 44. The distributed computer network of claim 40, further comprising means for the computer than acts as the top level of the hierarchy to broadcast information throughout the hierarchy.
 45. The distributed computer network of claim 40, further comprising means to control a bandwidth utilization of the collection of computers.
 46. The distributed computer network of claim 40, further comprising a plurality of lower level computers, wherein information regarding the lower level computers is stored in a respective one of the computers in the collection of computers.
 47. The distributed computer network of claim 40, further comprising means for rebuilding a logical arrangement of the collection of computers following a loss of at least one computer from the collection of computers.
 48. The distributed computer network of claim 40, further comprising means for distributing software updates throughout the collection of computers.
 49. The distributed computer network of claim 40, wherein each computer in the collection of computers includes a dynamic physical address.
 50. The distributed computer network of claim 40, further comprising means for generating the logical arrangement to substantially minimize a logical distance between a logical center of the collection of computers and a logical collection edge. 